A-Q alphabetic anaesthetic assessment algorithm

A New Algorithm for Building Alphabetic Minimax Trees

We show how to build an alphabetic minimax tree for a sequence W = w1, . . . , wn of real weights in O(nd log logn) time, where d is the number of distinct integers ⌈wi⌉. We apply this algorithm to building an alphabetic prefix code given a sample.

Assessment of the anaesthetic and metabolic activities of dioxychlorane, a new halogenated volatile anaesthetic agent.

The ability of dioxychlorane to depress cortical activity in rats with implanted electrodes was compared to that reported previously for methoxyflurane, halothane and enflurane. Dioxychlorane was eight times more potent than enflurane, five times more potent than halothane and twice as potent as methoxyflurane. Serum fluoride concentrations after the administration of dioxychlorane and enfluran...

A $q$-Robinson-Schensted-Knuth Algorithm and a $q$-Polymer

In Matveev-Petrov (2017) a q-deformed Robinson-Schensted-Knuth algorithm (qRSK) was introduced. In this article we give reformulations of this algorithm in terms of the Noumi-Yamada description, growth diagrams and local moves. We show that the algorithm is symmetric, namely the output tableaux pairs are swapped in a sense of distribution when the input matrix is transposed. We also formulate a...

Anaesthetic assessment and preparation for surgery

The nature of anaesthetists’ training and experience makes them uniquely qualifi ed to assess the inherent risks of giving an anaesthetic. Ideally, every patient should be seen by an anaesthetist prior to surgery in order to identify, manage, and minimize these risks. Traditionally, this occurred when the patient was admitted, usually the day before an elective surgical procedure. However, if a...

Anaesthetic Novice Decision Support Algorithm (ANDSA)